The dual minimum distance of arbitrary dimensional algebraic--geometric codes
نویسنده
چکیده
In this article, the minimum distance of the dual C⊥ of a functional code C on an arbitrary–dimensional variety X over a finite field Fq is studied. The approach is based on problems à la Cayley–Bacharach and consists in describing the minimal configurations of points on X which fail to impose independent conditions on forms of some fixed degree m. If X is a curve, the result improves in some situations the well-known Goppa designed distance. AMS Classification: 14J20, 94B27, 14C20.
منابع مشابه
Differential approach for the study of duals of algebraic-geometric codes on surfaces
In this article, a differential construction for the dual of an algebraic-geometric code on a projective surface is given. Afterwards, this result is used to lower bound the minimum distance of this dual code. The found bounds involve intersection numbers of some particular divisors on the surface. AMS Classification: 14J20, 94B27, 11G25.
متن کاملCodes Closed under Arbitrary Abelian Group of Permutations
Algebraic structure of codes over Fq , closed under arbitrary abelian group G of permutations with exponent relatively prime to q, called G-invariant codes, is investigated using a transform domain approach. In particular, this general approach unveils algebraic structure of quasicyclic codes, abelian codes, cyclic codes, and quasi-abelian codes with restriction on G to appropriate special case...
متن کاملThe dual geometry of Hermitian two-point codes
In this paper we study the algebraic geometry of any two-point code on the Hermitian curve and reveal the purely geometric nature of their dual minimum distance. We describe the minimum-weight codewords of many of their dual codes through an explicit geometric characterization of their supports. In particular, we show that they appear as sets of collinear points in many cases.
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملConstruction of Linear Codes Having Prescribed Primal-dual Minimum Distance with Applications in Cryptography
A method is given for the construction of linear codes with prescribed minimum distance and also prescribed minimum distance of the dual code. This works for codes over arbitrary finite fields. In the case of binary codes Matsumoto et al. showed how such codes can be used to construct cryptographic Boolean functions. This new method allows to compute new bounds on the size of such codes, extend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0905.2345 شماره
صفحات -
تاریخ انتشار 2009